Strongly polynomial sequences as interpretations
نویسندگان
چکیده
منابع مشابه
Strongly polynomial sequences as interpretations
A strongly polynomial sequence of graphs (Gn) is a sequence (Gn)n∈N of finite graphs such that, for every graph F , the number of homomorphisms from F to Gn is a fixed polynomial function of n (depending on F ). For example, (Kn) is strongly polynomial since the number of homomorphisms from F to Kn is the chromatic polynomial of F evaluated at n. In earlier work of de la Harpe and Jaeger, and m...
متن کاملPolynomial Interpretations with Negative Coefficients
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x− 1 for a unary function symbol or x− y for a binary function symbol, can be used to extend the class of rewrite systems that can be automatically proved terminating.
متن کاملPolynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. In 2006, Lucas proved that there are rewrite systems that can be shown polynomially terminating by polynomial interpretations with real (algebraic) coefficients, but cannot be shown polynomially ...
متن کاملPolynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main result of this paper is that a polynomial interpretation termination proof of a rewrite system R which computes a number theoretic function implies a polynomial bound on that function’s rate of growth.
متن کاملAmortised Resource Analysis and Typed Polynomial Interpretations
We introduce a novel resource analysis for typed term rewrite systems based on a potential-based type system. This type system gives rise to polynomial bounds on the innermost runtime complexity. We relate the thus obtained amortised resource analysis to polynomial interpretations and obtain the perhaps surprising result that whenever a rewrite system R can be well-typed, then there exists a po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2016
ISSN: 1570-8683
DOI: 10.1016/j.jal.2016.06.001